A Higher-Order Computational Model for Cooperative Constraint Programming

This paper presents a theoretical framework for the integration of the cooperative constraint solving of several algebraic domains into higher-order functional and logic programming on λ-abstractions, using the instance CFLP(C) of the generic Constraint Functional Logic Programming (CFLP ) scheme [7] over a so-called higher-order coordination domain C. We provide this framework as a powerful computational model for the higher-order cooperation of algebraic constraint domains over real numbers R and integers FD, which has been useful in practical applications involving the hybrid combination of its components, so that more declarative and efficient solutions can be promoted. Our proposal of computational model has been proved sound and complete with respect to the declarative semantics provided by the CFLP scheme, and enriched with new mechanisms for modeling the intended cooperation among the algebraic domains and a higher-order constraint domain h equipped with a sound and complete constraint solver for solving higher-order equations.